combinatorial optimization problem meaning in Chinese

组合最优化问题

A novel algorithm and its convergence for a class of combinatorial optimization problems
一类组合优化问题的新解法及其收敛性
This paper studies the approximation algorithms of some combinatorial optimization problems
本文主要研究组合优化中若干问题的近似算法。
In addition , simulated annealing algorithm for the combinatorial optimization problem here is also given
此外，利用模拟退火算法成功地解决了该组合优化问题。
Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局问题是具有np完备计算复杂度的离散组合优化问题。
Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm
成组技术问题是组合优化问题,而遗传算法正是目前求解组合最优化的有效方法之一。

More: Next